Stack-run image coding

We describe a new image coding approach in which a 4-ary arithmetic coder is used to represent signiicant coeecient values and the lengths of zero runs between coeecients. This algorithm works by raster scanning within subbands, and therefore involves much lower addressing complexity than other algorithms such as zerotree coding that require the creation and maintenance of lists of dependencies across diierent decomposition levels. Despite its simplicity, and the fact that these dependencies are not explicitly utilized, the algorithm presented here is competitive with the best enhancements of zerotree coding. In addition, it performs comparably with adaptive subband splitting approaches that involve much higher implementation complexity. Finally, although this technique is described here in the context of a wavelet coding system, it can also be applied in a block DCT framework.